Mixed-criticality Scheduling: Improved Resource-augmentation Results

Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such “mixed-criticality” systems give rise to some interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional scheduling theory. It had previously been shown that determining whether a system specified in this model can be scheduled to meet all its certification requirements is highly intractable. Prior work [4] had also introduced a simple, prioritybased scheduling algorithm called OCBP for mixed criticality systems, and had quantified, via the metric of processor speedup factor, the effectiveness of OCBP in scheduling dual-criticality systems – systems subject to two sets of certification requirements. In this paper, we extend this result to systems with arbitrarily many distinct criticality levels, by deriving a quantitative processor speedup factor (that depends on n) for OCBP when scheduling systems with n criticality levels for arbitrary n.